Near-threshold high-order harmonic spectroscopy with aligned molecules

We study high-order harmonic generation in aligned molecules close to the ionization threshold. Two distinct contributions to the harmonic signal are observed, which show very different responses to molecular alignment and ellipticity of the driving field. We perform a classical electron trajectory analysis, taking into account the significant influence of the Coulomb potential on the strong-field-driven electron dynamics. The two contributions are related to primary ionization and excitation processes, offering a deeper understanding of the origin of high harmonics near the ionization threshold. This work shows that high harmonic spectroscopy can be extended to the near-threshold spectral range, which is in general spectroscopically rich.Comment: 4 pages, 4 figure

Fast and scalable optical packet switch architecture for computer communication networks

We present a novel low latency, high throughput and scalable optical packet switch (UPS) capable to optically interconnect hundreds of input/output ports. We focus on a strictly non-blocking Spanke architecture with contention resolution based on wavelength conversion. Highly distributed control of the UPS reduces the switching time to few nanoseconds regardless the amount of inputs/outputs. Queuing node analysis (mean values analysis) of input buffers in a computer communication network with windowflow control confirms that the new architecture, unlike rearrangeable nonblocking (i.e. Benes) architecture, can operate with low latency and high throughput with a very large amount of input/output ports

The mass insertion approximation without squark degeneracy

We study the applicability of the mass insertion approximation (MIA) for calculations of neutral meson mixing when squark masses are not degenerate and, in particular, in models of alignment. We show that the MIA can give results that are much better than an order of magnitude estimate as long as the masses are not strongly hierarchical. We argue that, in an effective two-squark framework, m_q=(m_1+m_2)/2 is the best choice for the MIA expansion point, rather than, for example, m_q^2=(m_1^2+m_2^2)/2.Comment: 7 pages, revtex

Impossibility of independence amplification in Kolmogorov complexity theory

The paper studies randomness extraction from sources with bounded independence and the issue of independence amplification of sources, using the framework of Kolmogorov complexity. The dependency of strings $x$ and $y$ is ${\rm dep}(x,y) = \max\{C(x) - C(x \mid y), C(y) - C(y\mid x)\}$, where $C(\cdot)$ denotes the Kolmogorov complexity. It is shown that there exists a computable Kolmogorov extractor $f$ such that, for any two $n$-bit strings with complexity $s(n)$ and dependency $\alpha(n)$, it outputs a string of length $s(n)$ with complexity $s(n)- \alpha(n)$ conditioned by any one of the input strings. It is proven that the above are the optimal parameters a Kolmogorov extractor can achieve. It is shown that independence amplification cannot be effectively realized. Specifically, if (after excluding a trivial case) there exist computable functions $f_1$ and $f_2$ such that ${\rm dep}(f_1(x,y), f_2(x,y)) \leq \beta(n)$ for all $n$-bit strings $x$ and $y$ with ${\rm dep}(x,y) \leq \alpha(n)$, then $\beta(n) \geq \alpha(n) - O(\log n)$

Asynchronous response of coupled pacemaker neurons

We study a network model of two conductance-based pacemaker neurons of differing natural frequency, coupled with either mutual excitation or inhibition, and receiving shared random inhibitory synaptic input. The networks may phase-lock spike-to-spike for strong mutual coupling. But the shared input can desynchronize the locked spike-pairs by selectively eliminating the lagging spike or modulating its timing with respect to the leading spike depending on their separation time window. Such loss of synchrony is also found in a large network of sparsely coupled heterogeneous spiking neurons receiving shared input.Comment: 11 pages, 4 figures. To appear in Phys. Rev. Let

Prediction of Maximal Heart Rate in Children and Adolescents.

OBJECTIVE: To identify a method to predict the maximal heart rate (MHR) in children and adolescents, as available prediction equations developed for adults have a low accuracy in children. We hypothesized that MHR may be influenced by resting heart rate, anthropometric factors, or fitness level. DESIGN: Cross-sectional study. SETTING: Sports medicine center in primary care. PARTICIPANTS: Data from 627 treadmill maximal exercise tests performed by 433 pediatric athletes (age 13.7 ± 2.1 years, 70% males) were analyzed. INDEPENDENT VARIABLES: Age, sex, sport type, stature, body mass, BMI, body fat, fitness level, resting, and MHR were recorded. MAIN OUTCOME MEASURES: To develop a prediction equation for MHR in youth, using stepwise multivariate linear regression and linear mixed model. To determine correlations between existing prediction equations and pediatric MHR. RESULTS: Observed MHR was 197 ± 8.6 b·min. Regression analysis revealed that resting heart rate, fitness, body mass, and fat percent were predictors of MHR (R = 0.25, P < 0.001), whereas age was not. Resting heart rate explained 15.6% of MHR variance, body mass added 5.7%, fat percent added 2.4%, and fitness added 1.2%. Existing adult equations had low correlations with observed MHR in children and adolescents (r = -0.03-0.34). CONCLUSIONS: A new equation to predict MHR in children and adolescents was developed, but was found to have low predictive ability, a finding similar to adult equations applied to children. CLINICAL RELEVANCE: Considering the narrow range of MHR in youth, we propose using 197 b·min as the mean MHR in children and adolescents, with 180 b·min the minimal threshold value (-2 standard deviations)

The Range of Topological Effects on Communication

We continue the study of communication cost of computing functions when inputs are distributed among $k$ processors, each of which is located at one vertex of a network/graph called a terminal. Every other node of the network also has a processor, with no input. The communication is point-to-point and the cost is the total number of bits exchanged by the protocol, in the worst case, on all edges. Chattopadhyay, Radhakrishnan and Rudra (FOCS'14) recently initiated a study of the effect of topology of the network on the total communication cost using tools from $L_1$ embeddings. Their techniques provided tight bounds for simple functions like Element-Distinctness (ED), which depend on the 1-median of the graph. This work addresses two other kinds of natural functions. We show that for a large class of natural functions like Set-Disjointness the communication cost is essentially $n$ times the cost of the optimal Steiner tree connecting the terminals. Further, we show for natural composed functions like $\text{ED} \circ \text{XOR}$ and $\text{XOR} \circ \text{ED}$, the naive protocols suggested by their definition is optimal for general networks. Interestingly, the bounds for these functions depend on more involved topological parameters that are a combination of Steiner tree and 1-median costs. To obtain our results, we use some new tools in addition to ones used in Chattopadhyay et. al. These include (i) viewing the communication constraints via a linear program; (ii) using tools from the theory of tree embeddings to prove topology sensitive direct sum results that handle the case of composed functions and (iii) representing the communication constraints of certain problems as a family of collection of multiway cuts, where each multiway cut simulates the hardness of computing the function on the star topology